DECISION SUPPORT SYSTEM FOR SOLVING THE STREET ROUTING PROBLEM
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولthe decision support system for the resolution of real-life vehicle routing and scheduling problem
in this paper, we investigate a decision support system (dss) for the resolution of real-life vehicle routing and scheduling problem (vrsp). scheduling the deliveries from a regional distribution centre (rdc) to large stores of a major fmcg retailer includes every possible vehicle routing complexity. usual constraints that are seen are: size of the vehicle and the length of the driving day, loa...
متن کاملUsing a spatial decision support system for solving the vehicle routing problem
Recent technological advances in Operational Research and Information Technology have enabled the development of high quality spatial decision support systems (SDSS). They constitute a new scientific area of information systems applications developed to support semi-structured or unstructured decisions, paying much attention to the spatial dimension of data to be analyzed, such as the location ...
متن کاملA decision support system for a real vehicle routing problem
The vehicle routing problem has been widely studied in the literature, mainly because of the real world logistics and transportation problems related to it. In the present paper, a new two-stage exact approach for solving a real problem is shown, along with decision making software. In the first stage, all the feasible routes are generated by means of an implicit enumeration algorithm; afterwar...
متن کاملThe Biobjective Inventory Routing Problem - Problem Solution and Decision Support
The article presents a study on a biobjective generalization of the inventory routing problem, an important optimization problem found in logistical networks in which aspects of inventory management and vehicle routing intersect. A compact solution representation and a heuristic optimization approach are presented, and experimental investigations involving novel benchmark instances are carried ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSPORT
سال: 2008
ISSN: 1648-4142,1648-3480
DOI: 10.3846/1648-4142.2008.23.230-235